Regev’s Theorem via Rectangles

نویسنده

  • JONATHAN NOVAK
چکیده

For any fixed integer d≥ 1, let ud(N) denote the number of permutations in the symmetric group S(N)which have no decreasing subsequence of length d+1.Regev determined the asymptotic form of ud(N) in the N→ ∞ limit; his argument relies on Selberg’s integral formula. In this article we give an elementary derivation of Regev’s formula via an asymptotic bijection with standard Young tableaux of rectangular shape.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Forbidden Suborder Characterization of Binarily Composable Diagrams in Double Categories

Tilings of rectangles with rectangles and tileorders the associated double order structures are useful as templates for composition in double categories In this context it is particularly relevant to ask which tilings may be joined together two rectangles at a time to form one large rectangle We characterize such tilings via forbidden suborders in a manner analogous to Kuratowski s characteriza...

متن کامل

The Z Alpern Multi-tower Theorem for Rectangles: a Tiling Approach

We provide a proof of the Alpern multi-tower theorem for Z d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z action by a collection of rectangles whose corresponding sides have no non-trivial common divisors. We associate to such a collection of rectangles a special family of generalized domino tilings. We then identify an intrinsic dynamic property of these ...

متن کامل

Shifting Segments to Optimality

Figure 2: Near rectangular dissections in applications. Note that in the applications the areas of the rectangles of a dissection are relevant, actually in most cases these areas are prescribed. A rectangular dissection is area-universal if for any assignment of positive weights to the rectangles there is an equivalent dissection such that the areas of rectangles are equal to the given weights....

متن کامل

On Tychonoff's type theorem via grills

‎Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces‎, ‎and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$‎. ‎We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ ‎related to these grills, and present a simple proof to this theorem‎. ‎This immediately yields the classical theorem...

متن کامل

A New Staircase Separator Theorem ? Viet

The notion of staircase separator, introduced in 2], greatly facilitates the design of divide-and-conquer algorithms for problems on rectangles. We generalize the concept of staircase separator to k-perfect staircase separator, namely a set of staircase separators which partitions a set S of n axis-parallel, disjoint rectangles into k subsets of (almost) equal size. We derive an optimal O(log n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009